Coevolutionary GA with a Stochastic Genetic Repair Operator for Solving Constraint Satisfaction Problems
نویسندگان
چکیده
منابع مشابه
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level one. The solution-level population searches for the good solution in a given problem. The schema-level population searches for the good schemata in the former population. Our CGA performs effectively by exchanging genet...
متن کاملCoevolutionary genetic algorithm for constraint satisfaction with a genetic repair operator for effective schemata formation
In this paper, we discuss on new Coevolutionary Genetic Algorithm for Constraint Satisfaction. Our basic idea is to explore effective genetic information in the population, i.e., schemata, and to exploit the genetic information in order to guide the population to better solutions. Our Coevolutiona,ry Genetic Algorithm (CGA) consists of two GA populations; the first GA, called ”H-GA”, searches f...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملSpread-Repair Algorithm for Solving Extended Fuzzy Constraint Satisfaction Problems
In this paper, we propose a new type of FCSPs called hybrid domain FCSPs that have a mixture of discrete and continuous domains. To solve this type of problems, we present an algorithm called Spread-Repair based on the framework of iterative improvement. Experimental results on some test problems show that the algorithm has an ability of finding local approximate solutions with high probability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 2001
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.37.567